AlphaTruss: Monte Carlo Tree Search for Optimal Truss Layout Design
نویسندگان
چکیده
Truss layout optimization under complex constraints has been a hot and challenging problem for decades that aims to find the optimal node locations, connection topology between nodes, cross-sectional areas of connecting bars. Monte Carlo Tree Search (MCTS) is reinforcement learning search technique competent solve decision-making problems. Inspired by success AlphaGo using MCTS, truss formulated as Markov Decision Process (MDP) model, 2-stage MCTS-based algorithm, AlphaTruss, proposed generating considering topology, geometry, bar size. In this MDP three sequential action sets adding bars, selecting sectional greatly expand solution space reward function gives feedback actions according both geometric stability structural simulation. To actions, AlphaTruss solves model best decision in each design step searching through MCTS. Compared with existing results from literature, exhibits better performance finding minimum weight stress, displacement, buckling constraints, which verifies validity efficiency established algorithm.
منابع مشابه
Monte-Carlo Tree Search
representation of the game. It was programmed in LISP. Further use of abstraction was also studied by Friedenbach (1980). The combination of search, heuristics, and expert systems led to the best programs in the eighties. At the end of the eighties a new type of Go programs emerged. These programs made an intensive use of pattern recognition. This approach was discussed in detail by Boon (1990)...
متن کاملParallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization methods for MCTS: leaf parallelization, root parallelization, and tree parallelization. To be effective tree parallelization requires two techni...
متن کاملMonte-Carlo Tree Search Solver
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (LOA). A new MCTS variant, called MCTS-Solver, has been designed to play narrow tactical lines better in sudden-death games such as LOA. The variant differs from the traditional MCTS in respect to backpropagation and se...
متن کاملCross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs. To improve the playing strength of these Go programs any further, many parameters dealing with MCTS should be fine-tuned. In this paper, we propose to apply the Cross-Entropy Method (CEM) for this task. The method is ...
متن کاملMonte-Carlo Tree Search Enhancements for Havannah
This article shows how the performance of a Monte-Carlo Tree Search (MCTS) player for Havannah can be improved, by guiding the search in the play-out and selection steps of MCTS. To improve the play-out step of the MCTS algorithm, we used two techniques to direct the simulations, Last-Good-Reply (LGR) and N-grams. Experiments reveal that LGR gives a significant improvement, although it depends ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Buildings
سال: 2022
ISSN: ['2075-5309']
DOI: https://doi.org/10.3390/buildings12050641